Ranking Based Multitask Learning of Scoring Functions

نویسندگان

  • Ivan Stojkovic
  • Mohamed F. Ghalwash
  • Zoran Obradovic
چکیده

Scoring functions are an important tool for quantifying properties of interest in many domains; for example, in healthcare, a disease severity scores are used to diagnose the patient’s condition and to decide its further treatment. Scoring functions might be obtained based on the domain knowledge or learned from data by using classification, regression or ranking techniques depending on the type of supervised information. Although learning scoring functions from collected data is beneficial, it can be challenging when limited data are available. Therefore, learning multiple distinct, but related, scoring functions together can increase their quality as shared regularities may be easier to identify. We propose a multitask formulation for ranking-based learning of scoring functions, where the model is trained from pairwise comparisons. The approach uses mixed-norm regularization to impose structural regularities among the tasks. The proposed regularized objective function is convex; therefore, we developed an optimization approach based on alternating minimization and proximal gradient algorithms to solve the problem. The increased predictive accuracy of the presented approach, in comparison to several baselines, is demonstrated on synthetic data and two different real-world applications; predicting exam scores and predicting tolerance to infections score.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A tree-based ranking algorithm and approximation of the optimal ROC curve

Recursive partitioning methods are among the most popular techniques in machine-learning. It is the purpose of this paper to investigate how such an appealing methodology may be adapted to the bipartite ranking problem. In ranking, the goal pursued is global: the matter is to learn how to define an order on the whole feature space X , so that positive instances take up the top ranks with maximu...

متن کامل

Learning Scoring Functions with Order-Preserving Losses and Standardized Supervision

We address the problem of designing surrogate losses for learning scoring functions in the context of label ranking. We extend to ranking problems a notion of orderpreserving losses previously introduced for multiclass classification, and show that these losses lead to consistent formulations with respect to a family of ranking evaluation metrics. An order-preserving loss can be tailored for a ...

متن کامل

Anomaly Ranking as Supervised Bipartite Ranking

The Mass Volume (MV) curve is a visual tool to evaluate the performance of a scoring function with regard to its capacity to rank data in the same order as the underlying density function. Anomaly ranking refers to the unsupervised learning task which consists in building a scoring function, based on unlabeled data, with a MV curve as low as possible at any point. In this paper, it is proved th...

متن کامل

Personalized Web Search by Using Learned User Profiles in Re-ranking

Search engines return results mainly based on the submitted query; however, the same query could be in different contexts because individual users have different interests. To improve the relevance of search results, we propose re-ranking results based on a learned user profile. In our previous work we introduced a scoring function for re-ranking search results based on a learned User Interest ...

متن کامل

Inductive Transfer using Kernel Multitask Latent Analysis

We develop the Kernel Multitask Latent Analysis (KMLA) method for modeling many-to-many relationships between inputs and responses, and show how it can be applied to inductive transfer problems in bioseparations. KMLA performs dimensionality reduction targeted towards a multitask loss function much like Kernel Partial Least Squares (KPLS). KPLS is limited to least squares multiple regression wh...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017